Minimizing Total Weighted Tardiness in a Flexible Flowshop Environment Considering Batch Processing Machines

Authors

  • Fattahi, N. Department of Industrial and Systems Engineering, Isfahan University of Technology, Iran.
  • Moslehi, G. Department of Industrial and Systems Engineering, Isfahan University of Technology, Iran.
  • Reisi-Nafchi, M. Department of Industrial and Systems Engineering, Isfahan University of Technology, Iran.
Abstract:

Scheduling in production environments is used as a competitive tool to improve efficiency and respond to customer requests. In this paper, a scheduling problem is investigated in a three-stage flexible flowshop environment with the consideration of blocking and batch processing. This problem has been inspired by the charging and packaging line of a large battery manufacturer. In this environment, the first and third stages involve a single processor machine, and the second one consists of m identical parallel batch processing machines. The objective is to minimize the total weighted tardiness of the received orders.Given the lack of consideration of this problem in the literature, first, a mathematical programming model is presented for the problem. Also, due to the NP-hardness of the problem, a variable neighborhood search algorithm and a memetic algorithm are developed to solve it. The computational results show that the variable neighborhood search algorithm can solve instances up to 1200 orders and 15 machines with an average deviation of about 1.9%, relative to the best solution of the two algorithms, and the memetic algorithm can solve instances up to 1200 orders and 15 machines with an average deviation of about 7.8%, as compared e to the best solution of the two algorithms. In general, computational results show the better performance of the variable neighborhood search algorithm in comparison to the memetic algorithm.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Minimizing the energy consumption and the total weighted tardiness for the flexible flowshop using NSGA-II and NRGA

This paper presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...

full text

Minimizing Total Tardiness in a Hybrid Flexible Flowshop with Sequence Dependent Setup Times

In this paper, we propose different local search algorithms to solve a realistic variant of the flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the total tardiness. In this variant of flowshop, stage skipping might occur, i.e., not all stages must be visited by all jobs. This scheduling...

full text

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

This paper addresses a scheduling problem motivated by scheduling of diffusion operations in the wafer fabrication facility. In the target problem, jobs arrive at the batch machines at different time instants, and only jobs belonging to the same family can be processed together. Parallel batch machine scheduling typically consists of three types of decisions – batch forming, machine assignment,...

full text

Minimizing total weighted tardiness on a single batch process machine with incompatible job families

The di0usion step in semiconductor wafer fabrication is very time consuming, compared to other steps in the process, and performance in this area has a signi1cant impact on overall factory performance. Di0usion furnaces are able to process multiple lots of similar wafers at a time, and are therefore appropriately modeled as batch processing machines with incompatible job families. Due to the im...

full text

Minimizing the total tardiness in a flexible job-shop

In this article, we consider the minimization of the total tardiness in a flexible job-shop. In our knowledge, this criterion is not previously studied for this type of shop configuration. The total tardiness criterion was mainly considered in the single machine problem (Chu [Chu92] and Souissi et al. [SKC04]). Few references studied this criterion in a job-shop configuration. The priority rule...

full text

Minimizing weighted total earliness, total tardiness and setup costs

A single machine scheduling problem is described which covers earliness costs, tardiness costs and setup costs. Setups are needed whenever a switch is made to a job of another product family. All jobs within the same product family have the same processing time. Besides setup costs also setup times are involved. Idle time is allowed, preemption is not allowed. Both a mixed integer programming f...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 39  issue 1

pages  105- 133

publication date 2020-08

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023